BOUNDING THE NUMBER OF COLUMNS WHICH APPEAR ONLY IN POSITIVE POOLS
نویسندگان
چکیده
منابع مشابه
Bounding the Number of Columns Which Appear Only in Positive Pools
d-separable, d-separable and d-disjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for d-disjunct matrices, only brute-force methods are known for the other two. In this paper we identify structures in these two matrices which lead to significa...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملBounding the Piercing Number
It is shown that for every k and every p ≥ q ≥ d + 1 there is a c = c(k, p, q, d) < ∞ such that the following holds. For every family H whose members are unions of at most k compact, convex sets in R in which any set of p members of the family contains a subset of cardinality q with a nonempty intersection there is a set of at most c points in R that intersects each member of H. It is also show...
متن کاملthe effect of the record infancy in crimilly acts of guilties (in karaj city)
چکیده یکی از مهمترین دغدغه های بزرگ جوامع بشری، از دیر باز تا کنون که ذهن پژوهشگران و متخصصان بهداشت روانی و اجتماعی و دولتها رابه خود مشغول داشته، مسأله ی بزهکاری می باشد. شناخت کامل پدیده ی بزهکاری و بزهکار، علل وعوامل سقوط یک انسان، چگونگی درمان وی و درنهایت پیشگیری ازبزهکاری ودریک کلام سالم سازی یک جامعه، رسالت عظیم، انسانی ومقدسی می باشد که با بررسی شخصیت مجرم یعنی[ انسانی که تحت شرای...
15 صفحه اولbounding the rainbow domination number of a tree in terms of its annihilation number
a {em 2-rainbow dominating function} (2rdf) of a graph $g$ is a function $f$ from the vertex set $v(g)$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin v(g)$ with $f(v)=emptyset$ the condition $bigcup_{uin n(v)}f(u)={1,2}$ is fulfilled, where $n(v)$ is the open neighborhood of $v$. the {em weight} of a 2rdf $f$ is the value $omega(f)=sum_{vin v}|f (v)|$. the {em $2$-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2006
ISSN: 1027-5487
DOI: 10.11650/twjm/1500403884